Graph partition

Results: 275



#Item
211Matrix theory / RANSAC / Singular value decomposition / Algebraic graph theory / Graph partition / Spectral clustering / Eigenvalues and eigenvectors / Adjacency matrix / Eigendecomposition of a matrix / Algebra / Mathematics / Linear algebra

Proc. RSS (Robotics: Science and Systems), Cambridge MA, pp[removed], June[removed]Single-Cluster Spectral Graph Partitioning for Robotics Applications Edwin Olson, Matthew Walter, Seth Teller, and John Leonard Computer S

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2006-12-06 18:30:42
212NP-complete problems / Matching / Graph partition / Resource Description Framework / Connectivity / Graph / Tree / Partition / Modular decomposition / Graph theory / Mathematics / Theoretical computer science

1 Scalable Keyword Search on Large RDF Data Wangchao Le, Feifei Li, Anastasios Kementsietsidis, Songyun Duan Abstract—Keyword search is a useful tool for exploring large RDF datasets. Existing techniques either rely o

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2014-01-20 17:41:00
213NP-complete problems / Hypergraph / Graph partition / Clique / Spectral clustering / Cluster analysis / Segmentation / K-means clustering / Consensus clustering / Graph theory / Mathematics / Theoretical computer science

Beyond Pairwise Clustering Sameer Agarwal1 , Jongwoo Lim1 , Lihi Zelnik-Manor2 , Pietro Perona2 , David Kriegman1 Serge Belongie1 1 Department of Computer Science & Engineering

Add to Reading List

Source URL: vision.ucsd.edu

Language: English - Date: 2005-04-15 19:48:44
214Network theory / Theoretical computer science / Algebraic graph theory / Network analysis / Modularity / Community structure / Centrality / Graph partition / Degree distribution / Graph theory / Mathematics / Networks

The Economics of Covert Community Detection and Hiding Shishir Nagaraja Computer Laboratory 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK [removed] April 26, 2008

Add to Reading List

Source URL: weis2008.econinfosec.org

Language: English - Date: 2008-05-09 10:38:11
215NP-complete problems / Vertex / Graph partition / Distance / Connected component / Matching / Minimum spanning tree / Connectivity / Graph theory / Theoretical computer science / Mathematics

Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing Zuhair Khayyat‡ Karim Awara‡

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2013-06-23 20:27:26
216Graph partition / Centrality / Graph / Connectivity / Connected component / Vertex / Graph coloring / Edge coloring / Graph theory / Mathematics / Theoretical computer science

GPS: A Graph Processing System ∗ Semih Salihoglu

Add to Reading List

Source URL: ilpubs.stanford.edu

Language: English - Date: 2013-05-06 18:20:29
217Spanning tree / Graphical models / Probability theory / Minimum spanning tree / NP-complete problems / Belief propagation / Tree decomposition / Connectivity / Markov random field / Graph theory / Mathematics / Theoretical computer science

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY[removed]A New Class of Upper Bounds on the Log Partition Function

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-08-15 12:26:48
218NP-complete problems / Combinatorial optimization / Cut / Graph connectivity / Graph coloring / Connectivity / Graph partition / Graph / Maximum flow problem / Graph theory / Mathematics / Theoretical computer science

TALIP ad-1/2 pg. vertical 4-C

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2012-09-07 04:32:07
219Combinatorial optimization / NP-complete problems / Cut / Graph connectivity / Graph partition / Connectivity / Matching / Minimum cut / Randomized algorithm / Graph theory / Mathematics / Theoretical computer science

Graph Partitioning using Single Commodity Flows Satish Rao Umesh Vazirani University of Waterloo,

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-01-02 19:10:42
220Combinatorial optimization / NP-complete problems / Operations research / Cut / Graph connectivity / Graph embedding / Graph partition / SL / Connectivity / Theoretical computer science / Mathematics / Applied mathematics

5 Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University, Princeton, New Jersey

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2012-09-06 20:58:15
UPDATE